	/**
	 * 快速排序算法
	 * @param array
	 * @param low
	 * @param hight
	 */
	public static void QuickSort(int[] array,int low,int hight){
		//if (array.length < 1 || low < 0 || hight >= array.length || low > hight) return null;
		if(low < hight){
			int privotpos = partition(array,low,hight);
			QuickSort(array,low,privotpos - 1);
			QuickSort(array,privotpos + 1,hight);			
		}
	
	}
	
	public static int partition(int[] array,int low,int hight){
		int privot = array[low];
		while(low < hight){
			while(low < hight && array[hight] >= privot) --hight;
			array[low] = array[hight];
			while(low < hight && array[low] <= privot) ++low;
			array[hight] = array[low];
		}
		array[low] = privot;
		return low;			
	}